Some Extremal Problems for Hereditary Properties of Graphs
نویسنده
چکیده
Given an in nite hereditary property of graphs P; the principal extremal parameter of P is the value (P) = lim n!1 n 2 1 maxfe (G) : G 2 P and v (G) = ng: The Erd1⁄2os-Stone theorem gives (P) if P is monotone, but this result does not apply to hereditary P. Thus, one of the results of this note is to establish (P) for any hereditary property P: Similar questions are studied for the parameter (p) (G) ; de ned for every real number p 1 and every graph G of order n as (p) (G) = max jx1j + + jxnj = 1 2 X
منابع مشابه
On some variations of extremal graph problems
A set P of graphs is termed hereditary property if and only if it contains all subgraphs of any graph G belonging to P. A graph is said to be maximal with respect to a hereditary property P (shortly P-maximal) whenever it belongs to P and none of its proper supergraphs of the same order has the property P. A graph is P-extremal if it has a the maximum number of edges among all P-maximal graphs ...
متن کاملStructure and Enumeration Theorems for Hereditary Properties in Finite Relational Languages
Given a finite relational language L, a hereditary L-property is a class of finite Lstructures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal combinatorics, including (but not limited to) hereditary properties of graphs, hypergraphs, and oriented graphs. In this paper, we generalize certain definitions, tools, and re...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کامل21 st British Combinatorial Conference University of Reading 9 th - 13 th July 2007
A hereditary property of graphs is a collection of (isomorphism classes of) graphs which is closed under taking induced graphs, and contains arbitrarily large structures. Given a family F of graphs, the family P(F) of graphs containing no member of F as an induced subgraph is a hereditary property, and every hereditary property of graphs arises in this way. A hereditary property of other combin...
متن کاملThe Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014